Bisimulation Equivanlence Is Decidable for Normed Process Algebra
نویسندگان
چکیده
We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is \elementary," having doubly exponential nondeterministic time complexity. ∗The rst author was supported in part by EPSRC Visiting Research Fellowships GR/K83243 and GR/M06468. Address for correspondence: School of Mathematical Sciences, The Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Ramat Aviv, Tel Aviv 69978, Israel. †The second author is supported in part by Esprit Working Group No. 21726, \RAND2." Address for correspondence: Department of Computer Science, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, United Kingdom.
منابع مشابه
Regularity is Decidable for Normed PA Processes in Polynomial Time
A process ∆ is regular if it is bisimilar to a process ∆′ with finitely many states. We prove that regularity of normed PA processes is decidable and we present a practically usable polynomial-time algorithm. Moreover, if the tested normed PA process ∆ is regular then the process ∆′ can be effectively constructed. It implies decidability of bisimulation equivalence for any pair of processes suc...
متن کاملUndecidable Equivalences for Basic Process Algebra
A recent theorem 3, 7, 19] shows that strong bisimilarity is decidable for the class of normed BPA processes, which correspond to a class of context-free grammars generating the-free context-free languages. In 21] Huynh and Tian have shown that readiness and failure equivalence are undecidable for BPA processes. In this paper we examine all other equivalences in the linear/branching time hierar...
متن کاملRegularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time
We consider the problem of deciding regularity of normed BPP and normed BPA processes. A process is regular if it is bisimilar to a process with finitely many states. We show that regularity of normed BPP and normed BPA processes is decidable in polynomial time and we present constructive regularity tests. Combining these two results we obtain a rich subclass of normed PA processes (called sPA)...
متن کاملComplexity Of Weak Bisimilarity And Regularity For Bpa And Bpp
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound for BPP have been demonstrated by Stribrna. Mayr achieved recently a result, saying that weak bisimilarity for BPP is Π2 -hard. We improve this lower bound to PSPACE, moreover for the restricted class of normed BPP. Weak...
متن کاملBranching Bisimilarity Checking for PRS
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any other models in the hierarchy of PRS (Process Rewrite Systems) whose branching bisimilarity is decidable. It is shown in this paper that the branching bisimilarity for both nOCN (normed One Co...
متن کامل